On Split-Coloring Problems
نویسندگان
چکیده
منابع مشابه
On sum edge-coloring of regular, bipartite and split graphs
An edge-coloring of a graph G with natural numbers is called a sum edge-coloring if the colors of edges incident to any vertex of G are distinct and the sum of the colors of the edges of G is minimum. The edge-chromatic sum of a graph G is the sum of the colors of edges in a sum edge-coloring of G. It is known that the problem of finding the edge-chromatic sum of an r-regular (r ≥ 3) graph is N...
متن کاملOn the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provide...
متن کاملColoring a Graph Using Split Decomposition
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular we present an O(nm) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a Ck or a Ck for some k ≥ 3.
متن کاملProbabilistic Coloring of Bipartite and Split Graphs
We revisit in this paper the probabilistic coloring problem ( ) and focus ourselves on bipartite and split graphs. We first give some general properties dealing with the optimal solution. We then show that the unique 2-coloring achieves approximation ratio 2 in bipartite graphs under any system of vertex-probabilities and propose a polynomial algorithm achieving tight appro...
متن کاملA survey on vertex coloring problems
This paper surveys the most important algorithmic and computational results on the Vertex Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the classical models for the VCP, and discusses how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem. Computational results on the best performing algorithms pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2005
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-005-4103-7